package com.zrrd.recursion;

public class Recursion {
    public int factorical(int n) {
        if (n == 1) {
            return 1;
        }
        return n * factorical(n - 1);
    }

    public int fobo(int n) {
        if (n == 1 || n == 2) {
            return 1;
        }
        return fobo(n) + fobo(n - 1);
    }

}
